Iterative process acceleration of calculation of unsteady,viscous, compressible,and heat‐conductive gas flows

In this paper, extrapolation technique is introduced in the Semi‐Implicit Method for Pressure‐Linked Equations ‐ Time Step (SIMPLE‐TS) finite volume iterative algorithm for calculation of compressible Navier–Stokes–Fourier equations subject of slip and jump boundary conditions. The initial state, required by the iterative solver in simulation of unsteady flow problems, is approximated in time by Lagrange polynomial extrapolation in each node. The approach is applicable to a parallel code in a straightforward way due to algorithmic independence of the neighboring nodes in the computational grid. A criterion is proposed to determine the order of extrapolation polynomial and stop the extrapolation execution, when the local steady state is reached. The approach is tested on different microflow problems: Couette flow, flow past a square in a microchannel at subsonic and supersonic speeds, and convective Rayleigh–Bénard flow of a rarefied gas. The acceleration varies from 1.14‐fold to 2.8‐fold. Copyright © 2014 John Wiley & Sons, Ltd.     

On the Hamming distances of repeated-root constacyclic codes of length 4ps

Let $p$ be an odd prime, $s$, $m$ be positive integers, $\gamma ,\lambda$ be nonzero elements of the finite field ${\mathbb{F}}_{p^m}$ such that ${\gamma }^{p^s}=\lambda$. In this paper, we show that, for any positive integer $\eta$, the Hamming distances of all repeated-root $\lambda$-constacyclic codes of length $\eta p^s$ can be determined by those of certain simple-root $\gamma$-constacyclic codes of length $\eta$. Using this result, Hamming distances of all constacyclic codes of length $4p^s$ are obtained. As an application, we identify all MDS $\lambda$-constacyclic codes of length $4p^s$.     

The a posteriori error estimates of Chebyshev–Petrov–Galerkin methods for second-order equations

In this paper, the a posteriori error estimates of Chebyshev–Petrov–Galerkin approximations are investigated. For simplicity, we choose the Poisson equation with Dirichlet boundary conditions to discuss the a posteriori error estimators, and deduce their efficient and reliable properties. Some numerical experiments are performed to verify the theoretical analysis for the a posteriori error estimators.     

Dimension polynomials of difference local algebras

We extend the concept of the difference dimension polynomial of a difference field extension to difference local algebras. The main theorem of the paper establishes the existence and form of the dimension polynomial associated with the localization of a finitely generated well-mixed difference algebra at a prime reflexive difference ideal.     

Bombieri's Theorem in Short Intervals

Under the assumption of sixth power large sieve mean-value of Dirichlet L-function,we improve Bombieri's theorem in short intervals by virtue of the large sieve method and Heath-Brown's identity.     

IMPORTANCE MEASURE OF CORRELATED VARIABLES IN POLYNOMIAL OUTPUT

为了解决一般工程问题中输出量为多项式情况下相关正态输入变量的贡献识别问题，以二次不含交叉项的多项输出量为例，利用多维相关正态分布及其条件分布的性质，解析地推导了相关正态输入变量对输出量总方差的独立贡献及相关贡献，采用算例验证了所推导的解析表达式的正确性．文中所推导的相关正态变量独立贡献和相关贡献的表达式可直接用于输出量为二次不含交叉项多项式或一次多项式情况下的输入变量贡献的识别，并且为其他新的算法提供了对照解，另外此方法亦可以推广至含交叉项的高阶多项式，解决更为复杂输出量情况下输入量的贡献识别问题．     

The polynomial reconstruction problem: The first 50 years

The problem of reconstructing the characteristic polynomial of a graph of order at least 3 from the collection of characteristic polynomials of its vertex-deleted subgraphs was posed by Cvetkovi? in 1973 as a spectral counter part to the well-known Ulam's reconstruction conjecture. Over the last 50 years, this problem has received notable attention, many positive results have been obtained, but in the general case the problem is still unresolved. In particular, no counter example is found in literature. In this expository paper we survey classical and some more recent results concerning the polynomial reconstruction problem, discuss some related problems, variations and generalizations.     

Approximating exponential and logarithmic functions using polynomial interpolation

This article takes a closer look at the problem of approximating the exponential and logarithmic functions using polynomials. Either as an alternative to or a precursor to Taylor polynomial approximations at the precalculus level, interpolating polynomials are considered. A measure of error is given and the behaviour of the error function is analysed. The results of interpolating polynomials are compared with those of Taylor polynomials.